Unreasonable Selflessness
نویسندگان
چکیده
منابع مشابه
Unreasonable and ` ` Unreasonable ’ ’ in Quantum Mechanics ?
The particles of quantum mechanics (QM) are discrete undulatory entities which are described in terms of the complex state vectors of the theory in full agreement with experiment. The wave± particle paradox stems from the fact that undulation and discreteness are inconsistent within the classical theory which was historically the point of departure for the canonical foundation . The author desc...
متن کاملUnreasonable Care
This paper examines “doctrinal feedback” in negligence law, and specifically in medical malpractice. Doctrinal feedback is an organic, reiterative process that causes inadvertent and inadvisable changes in both law and practice. It occurs when: (1) the ambiguity of the applicable legal standard prompts those it governs to behave overcautiously, so as to avoid the gray areas of liability; (2) th...
متن کاملMindfulness-induced selflessness: a MEG neurophenomenological study
Contemporary philosophical and neurocognitive studies of the self have dissociated two distinct types of self-awareness: a "narrative" self-awareness (NS) weaving together episodic memory, future planning and self-evaluation into a coherent self-narrative and identity, and a "minimal" self-awareness (MS) focused on present momentary experience and closely tied to the sense of agency and ownersh...
متن کاملUnreasonable Effectivness of Deep Learning
We show how well known rules of back propagation arise from a weighted combination of finite automata. By redefining a finite automata as a predictor we combine the set of all k-state finite automata using a weighted majority algorithm. This aggregated prediction algorithm can be simplified using symmetry, and we prove the equivalence of an algorithm that does this. We demonstrate that this alg...
متن کاملThe unreasonable effectiveness of martingales
Proof. Consider p-bond percolation on an an infinite dregular tree T rooted at ρ and write CT (ρ) for the component containing ρ. Write CG(v) for the component of v in Gp. It is clear that we can couple such that |CG(v)| ≤ |CT (ρ)|. Recall the exploration process on T : At time t = 0 only ρ = v1 is active, other vertices neutral. At time t ≥ 0 if the number of active vertices Mt > 0, then set t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Veritas (Porto Alegre)
سال: 2017
ISSN: 1984-6746,0042-3955
DOI: 10.15448/1984-6746.2016.3.25759